Emitter Localisation from Reception Timestamps in Asynchronous Networks
نویسندگان
چکیده
We address the problem of localising a mobile terrminal (“blind” node) in unknown position from a set of “anchor” nodes in known positions. The proposed method does not require any form of node synchronisation nor measurement (or control) of the transmission times, which is difficult or anyway costly to achieve in practice. It relies exclusively on reception timestamps collected by the anchor nodes, according to their local clocks, that overhear packets transmitted by the blind node and by (at least one) other transmitting node(s) in known position, e.g., other anchors. The clock differences between the nodes are not eliminated ex ante through clock synchronisation, as in traditional ToA and TDoA methods. Instead, they are counteracted ex post, during the data processing stage, leveraging the data redundancy that is intrinsic to the multiple reception of the same packet by different (anchor) nodes. We validate the proposed method in two experimental setting, indoor and outdoor, using exclusively low-cost Commercial-Off-The-Shelf WiFi devices, and obtain sub-meter accuracy in Line-of-Sight conditions. The proposed method does not require that the blind node participate actively to the localisation procedure and can use “opportunistically” any legacy signal or packet available over-the-air for communication purposes. Considering the very minimal requirement on the system — basically, only that anchors in known positions are able to collect and share reception timestamps — the proposed approach can enable practical adoption of opportunistic and/or cooperative localisation on top of existing radio communication systems.
منابع مشابه
Time to timestamp: opportunistic cooperative localization from reception time measurements
We present a general framework for improving and extending GNSS-‐based positioning by leveraging opportunistic measurements from legacy terrestrial radio signals. The proposed approach requires only that participating nodes collect and share reception timestamps of incoming BLOCKIN BLOCKIN packets BLOCKIN BLOCKIN and/or BLOCKIN BLOCKIN other BLOCKIN BLOCKIN reference BLOCKIN BLOCKIN signals BL...
متن کاملDALD:-Distributed-Asynchronous-Local-Decontamination Algorithm in Arbitrary Graphs
Network environments always can be invaded by intruder agents. In networks where nodes are performing some computations, intruder agents might contaminate some nodes. Therefore, problem of decontaminating a network infected by intruder agents is one of the major problems in these networks. In this paper, we present a distributed asynchronous local algorithm for decontaminating a network. In mos...
متن کاملVerification of Security Protocols Using A Formal Approach
Security protocols are expected to build secure communications over vulnerable networks. However, security protocols may contain potential flaws. Therefore, they need formal verifications. In this thesis, we investigate Paulson’s inductive approach and apply this formal approach to a classical cryptographic protocol which has not been previously verified in this way. We also investigate the mod...
متن کاملCost-effective, asynchronous inter-sensor distance estimation using trigonometry
ELECT Precise estimation of inter-sensor distances is essential for reliable localisation in Internet of Things sensor networks. A cost-effective, scalable, asynchronous solution to estimate inter-sensor distances based solely on measurements of distances to a moving object is proposed. More specifically, the proposed solution estimates uncharted distances using trigonometry and processes these...
متن کاملMinimizing Timestamp Size for Completely Asynchronous Optimistic Recovery with Minimal Rollback - Reliable Distributed Systems, 1996. Proceedings., 15th Symposium on
Basing rollback recovery on optimistic message logging and replay avoids the need for synchronization between processes during failure-free execution. Some previous research has also attempted to reduce the need for synchronization during recovery, but these protocols have suffered from three problems: not eliminating all synchronization during recovery, not minimizing rollback, or providing th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computer Networks
دوره 88 شماره
صفحات -
تاریخ انتشار 2015